An Advancing Front Meshing Algorithm Using NURBS for Semiconductor Process Simulation
نویسندگان
چکیده
A surface extraction algorithm with NURBS has been developed for the mesh generation from the scattered data after a cell-based simulation. The triangulation of a surface is initiated with a step of describing the geometry along the polygonal boundary with multiple points. In this work, an NURBS surface can be generated with scattered data for each polygonal surface by employing a multilevel B-spline surface approximation. The NURBS mesh in accordance with our algorithm excellently represents the surface evolution of the topography on the wafer. A dynamically allocated topography model, so-called cell advancing model, is proposed to resolve an extensive memory requirement for the numerical simulation of a complicated structure on the wafer. A concave cylindrical DRAM cell capacitor was chosen to test the capability of our model. A set of capacitance present in the cell capacitor and interconnects was calculated with three-dimensional tetrahedral meshes generated from the NURBS surface on CRAY T3E supercomputer. A total of 5,475,600 (130 × 156 × 270) cells was employed for the simulation of semiconductor regions comprising four DRAM cell capacitors with a dimension of 1.3μm × 1.56μm × 2.7μm. The size of the required memory is about 22Mbytes and the simulation time is 64,082 seconds. The number of nodes for the FEM calculation was 70,078 with 395,064 tetrahedrons. key words: NURBS surface, mesh generation, advancing front,
منابع مشابه
Three-Dimensional Delaunay Mesh Generation Using a Modified Advancing Front Approach
We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...
متن کاملThree-Dimensional Delaunay Mesh Generation Using a Modi ed Advancing Front Approach
We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...
متن کاملAuto-meshing algorithm for acoustic analysis of vocal tract
We propose a new method for an auto-meshing algorithm for an acoustic analysis of the vocal tract using the Finite Element Method (FEM). In our algorithm, the domain of the 3 dimensional figure of the vocal tract is decomposed into two domains; one is a surface domain and the other is an inner domain in order to employ the overlapping domain decomposition method. The meshing of surface blocks c...
متن کاملBiting Spheres in 3D
We present an eecient 3D meshing algorithm which combines the merits of two popular meshing methods, advancing front and sphere packing methods. In particular , it inherits the practicality and simplicity of advancing front and the size-and-quality guarantee of the sphere packing method. We prove that it generates a well-shaped mesh whose size is within a constant factor of the optimal possible...
متن کاملA mesh generation procedure to simulate bimaterials
It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...
متن کامل